comparison of simulated annealing, genetic, and tabu search algorithms for fracture network modeling

Authors

saeed mahmoodpour

mohsen masihi

sajjad gholinejhad

abstract

the mathematical modeling of fracture networks is critical for the exploration and development ofnatural resources. fractures can help the production of petroleum, water, and geothermal energy. theyalso greatly influence the drainage and production of methane gas from coal beds. orientation andspatial distribution of fractures in rocks are important factors in controlling fluid flow. the objectivefunction recently developed by masihi et al. 2007 was used herein to generate fracture models thatincorporate field observations. to extend this method, simulated annealing, genetic, and tabu searchalgorithms were employed in the modeling of fracture networks. the effectiveness of each algorithmwas compared and the applicability of the methodology was assessed through a case study. it isconcluded that the fracture model generated by simulated annealing is better compared to thosegenerated by genetic and tabu search algorithms.

Upgrade to premium to download articles

Sign up to access the full text

Already have an account?login

similar resources

Comparison of Simulated Annealing, Genetic, and Tabu Search Algorithms for Fracture Network Modeling

The mathematical modeling of fracture networks is critical for the exploration and development of natural resources. Fractures can help the production of petroleum, water, and geothermal energy. They also greatly influence the drainage and production of methane gas from coal beds. Orientation and spatial distribution of fractures in rocks are important factors in controlling fluid flow. The obj...

full text

Parallel Search for Combinatorial Optimization: Genetic Algorithms, Simulated Annealing, Tabu Search and GRASP

In this paper, we review parallel search techniques for approximating the global optimal solution of combinatorial optimization problems. Recent developments on parallel implementation of genetic algorithms, simulated annealing, tabu search, and greedy randomized adaptive search procedures (GRASP) are discussed.

full text

Performance of Simulated Annealing, Tabu Search, and Evolutionary Algorithms for Multi-objective Network Partitioning

Most real optimization problems often involve multiple objectives to optimize. In single-objective optimization there exists a global optimum, while in the multi-objective case no optimal solution is clearly defined but rather a set of solutions, so called Pareto-optimal set. Thus, the goal of multi-objective strategies is to obtain an approximation to this set. However, the majority of this ki...

full text

Genetic Algorithms, Tabu Search and Simulated Annealing: a Comparison between Three Approaches for the Cryptanalysis of Transposition Cipher

Due to increasing incidents of cyber attacks, the demand for effective internet security is increasing. Cryptology is the science and study of systems for secret communication. It consists of two complementary fields of study: cryptography and cryptanalysis. In this paper, we propose a cryptanalysis method based on genetic algorithm, tabu search & simulated annealing to break a transposition ci...

full text

A Comparison of Intelligent Admission Control Schemes for Next Generation Wireless Systems using Genetic Algorithms, Simulated Annealing and Tabu Search

Mobile users will have a variety of services including high-speed data and real-time multimedia services with Next Generation Wireless Systems (NGWS). A unified and efficient handoff management is one of the key issues for NGWS to support global roaming of mobile users among different network architectures. In this paper, different artificial intelligence algorithms such as genetic algorithms (...

full text

Hardware Support for Simulated Annealing and Tabu Search

In this paper, we present a concept of a CPU kernel with hardware support for local-search based optimization algorithms like Simulated Annealing (SA) and Tabu-Search (TS). The special hardware modules are: (i) A linked-list memory representing the problem space. (ii) CPU instruction set extensions supporting fast moves within the neighborhood of a solution. (iii) Support for the generation of ...

full text

My Resources

Save resource for easier access later


Journal title:
iranian journal of oil & gas science and technology

Publisher: petroleum university of technology

ISSN 2345-2412

volume 4

issue 2 2015

Hosted on Doprax cloud platform doprax.com

copyright © 2015-2023